Algebraic Solution of Tropical Polynomial Optimization Problems

نویسندگان

چکیده

We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with addition and invertible multiplication). The are to minimize objective functions given by analogues of multivariate Puiseux polynomials, subject box constraints variables. A technique for variable elimination is presented that converts original problem new one which removed constraint this modified. novel approach may be thought as an extension Fourier-Motzkin method systems linear inequalities ordered fields issue polynomial semifields. use develop procedure solve finite number iterations. includes two phases: backward forward substitution describe main steps procedure, discuss its computational complexity present numerical examples.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic solutions of tropical optimization problems

We consider multidimensional optimization problems, which are formulated and solved in terms of tropical mathematics. The problems are to minimize (maximize) a linear or nonlinear function defined on vectors of a finite-dimensional semimodule over an idempotent semifield, and may have constraints in the form of linear equations and inequalities. The aim of the paper is twofold: first to give a ...

متن کامل

Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling

Optimization problems are considered in the framework of tropical algebra to minimize and maximize a nonlinear objective function defined on vectors over an idempotent semifield, and calculated using multiplicative conjugate transposition. To find the minimum of the function, we first obtain a partial solution, which explicitly represents a subset of solution vectors. We characterize all soluti...

متن کامل

Algebraic Degree of Polynomial Optimization

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, we prove that the optimality conditions always hold on optimizers, and the coordinates of optimizers are algebraic functions of the coefficients of the input polynomials. We also give a general formula for the algebraic degree of the opti...

متن کامل

Tropical optimization problems

We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent semifields, and may involve constraints in the form of linear equations and inequalities. The objective function can be either a linear function or nonlinear fu...

متن کامل

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9192472